package xiaohu.day6.HJ69;

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int x = in.nextInt();
        int y = in.nextInt();
        int z = in.nextInt();
        int[][] a = new int[x + 1][y + 1];
        int[][] b = new int[y + 1][z + 1];
        for (int i = 1; i <= x; i++) {
            for (int j = 1; j <= y; j++) {
                a[i][j] = in.nextInt();
            }
        }
        for (int i = 1; i <= y; i++) {
            for (int j = 1; j <= z; j++) {
                b[i][j] = in.nextInt();
            }
        }
        int[][] c = new int[x+1][z+1];

        //重点、矩阵乘法、从C的角度去理解
        for (int i = 1; i <= x; i++) {
            for (int j = 1; j <= z; j++) {
                for (int k = 1; k <= y; k++) {
                    c[i][j] += a[i][k] * b[k][j];
                }
            }
        }
        for (int i = 1; i <= x; i++) {
            for (int j = 1; j <= z; j++) {
                System.out.print(c[i][j]+" ");
            }
            System.out.println();
        }
    }
}